翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

axiom schema of replacement : ウィキペディア英語版
axiom schema of replacement

In set theory, the axiom schema of replacement is a schema of axioms in Zermelo–Fraenkel set theory (ZFC) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infinite sets in ZFC.
The axiom schema is motivated by the idea that whether a class is a set depends only on the cardinality of the class, not on the rank of its elements. Thus, if one class is "small enough" to be a set, and there is a surjection from that class to a second class, the axiom states that the second class is also a set. However, because ZFC only speaks of sets, not proper classes, the schema is stated only for definable surjections, which are identified with their defining formulas.
== Statement ==

Suppose ''P'' is a definable binary relation (which may be a proper class) such that for every set ''x'' there is a unique set ''y'' such that ''P''(''x'',''y'') holds. There is a corresponding definable function ''F''''P'', where ''F''''P''(''X'') = ''Y'' if and only if ''P''(''X'',''Y''); ''F'' will also be a proper class if ''P'' is. Consider the (possibly proper) class ''B'' defined such for every set ''y'', ''y'' is in ''B'' if and only if there is an ''x'' in ''A'' with ''F''''P''(''x'') = ''y''. ''B'' is called the image of ''A'' under ''F''''P'', and denoted ''F''''P''() or (using set-builder notation) .
The axiom schema of replacement states that if ''F'' is a definable class function, as above, and ''A'' is any set, then the image ''F''() is also a set. This can be seen as a principle of smallness: the axiom states that if ''A'' is small enough to be a set, then ''F''() is also small enough to be a set. It is implied by the stronger axiom of limitation of size.
Because it is impossible to quantify over definable functions in first-order logic, one instance of the schema is included for each formula φ in the language of set theory with free variables among ''w''1, ..., ''w''''n'', ''A'', ''x'', ''y''; but ''B'' is not free in φ. In the formal language of set theory, the axiom schema is:
:\begin
\forall w_1,\ldots,w_n \, \forall A \, ( (\forall x \in A &\, \exists ! y \, \phi(x, y, w_1, \ldots, w_n, A) ) \\
&\Rightarrow \exists B \, \forall y \, (\in B \Leftrightarrow \exists x \in A \, \phi(x, y, w_1, \ldots, w_n, A) ) )
\end

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「axiom schema of replacement」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.